We look up a hash table with linked list based upon the hash key for the logging token name. 我们需要根据日志标记名使用的散列值对具有链表(linkedlist)的散列表进行查询。
The linked list hash table contains information about the shared memory logging token pointers. 这个链表散列表包含有关共享内存日志标记指针的信息。
In this method, one of the tables, usually the smaller one, is scanned and used to create a hash table in memory. 在该方法中,需要扫描其中的一个表,通常扫描较小的那个表,用它在内存中创建一个哈希表。
This class builds a hash table of key-value pairs at the class instantiation. 此类在类实例化时构建一个键值对哈希表。
Note that the variable_map class resembles a hash table in many respects. 请注意,variablemap类在许多方面与哈希表非常相似。
It generates a hash table from the predetermined list of valid command-line options and a lookup function whose time complexity is O ( 1). 它将从预定的有效命令行选项列表和时间复杂度为O(1)的查找函数中生成一个散列表。
The inode cache is implemented as two lists and a hash table for faster lookup. 为了实现更快的查找速度,inode缓存被实现为两个列表和一个散列表。
The curly braces ( {}) indicate a hash table, which is a set of name and value pairs. 大括号({})则表明这是一个散列表,该散列表由一组名称和值对组成。
You will use the resulting hash table in your servlet to output the list of categories. 在servlet中,将使用产生的散列表输出类别列表。
Because the-C option was used for gperf invocation, the hash table is defined with the const attribute. 因为使用-C选项进行gperf调用,将使用const属性定义散列表。
The initialization process may also introduce name-object associations in the System Properties hash table. 这个初始化过程还可以引入SystemProperties散列表中的名称-对象关联。
The dentry cache is built using a hash table and is hashed by the name of the object. 使用散列表创建dentry缓存,并且根据对象名分配缓存。
For each logging token read from the shared memory or configuration file on its first invocation, OPEN_LOG builds a hash key using the name of the token and the size of the hash table. 对于每个从共享内存或初次调用使用的配置文件中读取的日志标记,OPENLOG都会使用标记名和散列表的大小来生成一个散列值。
Because the-G option is specified from the command line, the hash table is generated in global scope. 由于命令行中指定了-G选项,将在全局范围内生成散列表。
An array into which data is inserted using a hash function is called a hash table. 使用哈希函数向数组插入数据后,这个数组就称为哈希表。
When a new record was added to the hash table. 当将新记录添加到哈希表时。
Adds data to the hash table. 将向该表中添加数据。
Symbols are effectively pointers to strings stored in a hash table. 符号实际上是一种指针,指向储存在哈希表中的字符串。
By using dynamic ordering and hash table, the testing times of the candidate closed inter-transacation itemsets is decreased. 此外,动态排序和哈希表极大地减少了频繁闭项集的测试次数。
Returns whether the hash table contains the specified key. 返回哈希表中是否包含指定的关键。
Instead it is based on a hash table like model. 它是建立在一种类似于散列表的模型上的。
If the hash table already contains the key then the old value is overwritten. 如果哈希表已包含的关键则是覆盖旧值。
Unable to initialize the outgoing sequences hash table. 无法初始化传出的顺序散列表格。
A successful lookup on a list or a hash table returns a pointer to the matching element. 一次成功的查询在一个列表或者Hash表中返回一个指针到匹配的要素。
This method uses a pre-computed hash table to serve as an index for short sequences. 这一方法利用一个预先计算的哈西表作为短序列的索引。
Explains how to use a hash table to store the event instances. 解释如何使用哈希表存储事件实例。
Messages are extracted into a working file to be translated and compiled into a hash table. 信息被提取到工作文件中进行翻译,并被编译成一张哈希表。
The program needs to access these names very quickly, so a hash table is the preferred data structure. 程序需要快速地访问这些名字,所以哈希表是理想的数据结构。
Insert each input row into a hash table, outputting each value for which no duplicate is found. 将每一个输入行插入哈希表,输出每个不重复的值。
Use an in-memory hash table to cache rows as they are processed. 使用内存中的哈希表高速缓存所处理的行。